package com.xsherl.leetcode.solution;

import java.util.Map;

/**
 */
public class MapCheck {

    private boolean check(Map<Character, Integer> a, Map<Character, Integer> b, int k) {
        for (Character key : b.keySet()) {
            Integer counta = a.getOrDefault(key, 0);
            int sub = b.get(key) - counta;
            if (sub != 0 && sub < k) {
                System.out.println(a + "-----" + b + "----" + b.get(key) + "---" + counta + "---" + key);
                return false;
            }
        }
        return true;
    }

}
